Efficient EDF Implementation for Small Embedded Systems
نویسندگان
چکیده
Modern embedded systems are often required to execute under stringent real-time constraints to satisfy high performance requirements. When the available computational resources are scarce, an efficient implementation of the scheduler is of crucial importance for containing system costs. In this paper, we present an efficient implementation of the Earliest Deadline First (EDF) scheduler, which is typically considered difficult and expensive to implement with respect to fixed priority algorithms, such as the Rate Monotonic (RM) scheduler. The higher resource utilization and the greater flexibility in handling aperiodic requests and overload conditions make EDF highly desirable for real-time embedded systems. We show that by using suitable kernel mechanisms for time representation, EDF can be effectively used even in small microprocessors for achieving precise time representation and increasing system utilization. Another important issue for adopting new schedulers in the market is their compliance with existing standards. For this reason, in this paper we discuss how to achieve a compliance with the OSEK/VDX API, widely used on automotive embedded systems, and we show how commercial kernels can integrate an EDF scheduler while maintaining an OSEK compliant API. Finally, we provide some performance measurements to show that implementing and EDF scheduler on a commercial OSEK-like kernel, such as ERIKA Enterprise, only introduces negligible overhead.
منابع مشابه
FIFO with Offsets: High Schedulability with Low Overheads
The OS scheduler’s memory and runtime overheads form crucial design constraints for embedded systems implemented on low-cost hardware platforms. Table-driven scheduling can provide a high level of schedulability; however, it also consumes significant amounts of memory. By contrast, effective non-preemptive scheduling policies, such as the non-workconserving Critical-Window EDF (CW-EDF), have lo...
متن کاملAn efficient and scalable implementation of global EDF in Linux
The increasing popularity of multi-core architectures is pushing researchers and developers to consider multi-cores for executing soft and hard real-time applications. Real-Time schedulers for multi processor systems can be roughly categorized into partitioned and global schedulers. The first ones are more adequate for hard real-time embedded systems, in which applications are statically loaded...
متن کاملAn Adaptive CPU Scheduling for Embedded Operating Systems using Genetic Algorithms
This paper explains novel CPU scheduling approach for embedded operating Systems. In this approach we have used genetic algorithm (GA). Proposed Adaptive algorithm combines both EDF and GA based algorithms, Basically the new algorithm uses EDF algorithm but when the system becomes overloaded, it will switch to GA based scheduling algorithm. Again, when the overload disappears, the system will s...
متن کاملA Reservation Scheduler for Real-Time Operating Systems
The increasing demand for embedded multimedia applications makes evident the need for end-to-end Quality of Service (QoS) provisioning. Particularly, operating systems, despite their location at end systems, switches or routers, must guarantee that resources under their control are adequately managed to fulfill the application requirements. This work proposes the implementation of QoS provision...
متن کاملA Note on the EDF Preemption Behavior in "Rate Monotonic Versus EDF: Judgment Day"
In [1], the author empirically compared EDF (Earliest Deadline First) and RM (Rate Monotonic) scheduling algorithms and made a few EDF preemption behavior observations based on data obtained from the first 1,000 time units of scheduling activities. However, based on test settings given in [1], the first 1,000 time units occupies only a small percentage of the entire task set’s hyper-period. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006